The storage space allocation problem in a dry bulk terminal: a heuristic solution
نویسندگان
چکیده
منابع مشابه
A genetic algorithm to solve the storage space allocation problem in a container terminal
In this paper, an efficient genetic algorithm (GA) is presented to solve an extended storage space allocation problem (SSAP) in a container terminal. The SSAP is defined as the temporary allocation of the inbound/outbound containers to the storage blocks at each time period with aim of balancing the workload between blocks in order to minimize the storage/retrieval times of containers. An exten...
متن کاملA tabu search heuristic for the dynamic space allocation problem
The dynamic space allocation problem (DSAP) presented here is a relatively new problem in the literature. It looks at the optimization of space/resource assignments during the implementation of project activities. More specifically, the DSAP assigns project activities and their required resources to workspaces and idle resources to storage spaces with respect to minimizing the sum of the distan...
متن کاملIntegrated Storage Space Allocation and Ship Scheduling Problem in Bulk Cargo Terminals
This study is motivated by the practice of large iron and steel companies, which have steady and heavy demands for bulk raw materials such as iron ore, coal, limestone and so on. These materials are usually transported to a bulk cargo terminal by ships (or to a station by trains). Once discharged, they are moved to and stored in bulk material stock yard, waiting for retrieval for production use...
متن کاملA heuristic and hybrid method for the tank allocation problem in maritime bulk shipping
In bulk shipping, ships often have multiple tanks and carry multiple inhomogeneous products at a time. When operating such ships it is therefore a major challenge to decide how to best allocate cargoes to available tanks while taking into account tank capacity, safety restrictions, ship stability and strength as well as other operational constraints. The problem of finding a feasible solution t...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2020
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2020.12.2868